Functional Elimination and All Constraints
نویسندگان
چکیده
We present new complexity results on the class of All constraints The central idea involves func tional elimination a general method of elimination whose focus is on the subclass of functional constraints One result is that for the subclass of All constraints strong n consistency and minimality is achievable in O en time where e n are the number of constraints and variables The main result is that we can solve All constraints in O e d n time where d is the domain size This is an improvement over known results which are O ed d n Furthermore our al gorithm also achieves strong n consistency and mini mality
منابع مشابه
Functional Elimination and 0/1/All Constraints
We present new complexity results on the class of 0/1/All constraints. The central idea involves functional elimination, a general method of elimination whose focus is on the subclass of functional constraints. One result is that for the subclass of "All" constraints, strong n-consistency and minimality is achievable in O(en) time, where e, n are the number of constraints and variables. The mai...
متن کاملEfficient Algorithms for Functional Constraints
Functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, e.g. arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for ...
متن کاملSolving functional constraints by variable substitution
Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitutio...
متن کاملLetting Keys and Functional Dependencies out of the Bag
Classical database theory is largely a theory of relations. Relations are sets of tuples in which no duplicate tuples occur. In practice, duplicate elimination is an operation that is considered to be too expensive in many situations. Fundamental classes of integrity constraints interact differently over bags than they do over relations. This holds for keys and functional dependencies, for exam...
متن کاملMiniZinc with Functions
Functional relations are ubiquitous in combinatorial problems – the Global Constraint Catalog lists 120 functional constraints. This paper argues that the ability to express functional constraints with functional syntax leads to more elegant and readable models, and that it enables a better translation of the models to different underlying solving technologies such as CP, MIP, or SAT. Yet, most...
متن کامل